Linear Programming Boosting by Column and Row Generation
نویسندگان
چکیده
We propose a new boosting algorithm based on a linear programming formulation. Our algorithm can take advantage of the sparsity of the solution of the underlying optimization problem. In preliminary experiments, our algorithm outperforms a state-of-the-art LP solver and LPBoost especially when the solution is given by a small set of relevant hypotheses and support vectors.
منابع مشابه
Linear preservers of g-row and g-column majorization on M_{n,m}
Let A and B be n × m matrices. The matrix B is said to be g-row majorized (respectively g-column majorized) by A, if every row (respectively column) of B, is g-majorized by the corresponding row (respectively column) of A. In this paper all kinds of g-majorization are studied on Mn,m, and the possible structure of their linear preservers will be found. Also all linear operators T : Mn,m ---> Mn...
متن کاملA Column Generation Algorithm For Boosting
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation simplex method. We prove that minimizing the soft margin error function (equivalent to solving an LP) directly optimizes a generalization error bound. LPBoost can be used to solve any boosting LP by iteratively optimizing the dual classification costs in a restricted...
متن کاملSimultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
Abstract: In this paper, we develop a simultaneous column-and-row generation algorithm that could be applied to a general class of large-scale linear programming problems. These problems typically arise in the context of linear programming formulations with exponentially many variables. The defining property for these formulations is a set of linking constraints, which are either too many to be...
متن کاملA Row-and-Column Generation Method to a Batch Machine Scheduling Problem
This paper studies a batch machine scheduling problem in which decisions on grouping jobs into batches and scheduling batches on parallel machines are jointly made. To address the problem, we model it as two-stage set-partitioning (TSSP) type formulation with exponential number of rows and columns. To find solutions, we propose a row-and-column generation method. The proposed method starts with...
متن کاملSolving the Integrated Airline Recovery Problem Using Column-and-Row Generation
Airline recovery presents very large and difficult problems requiring high quality solutions within very short time limits. To improve computational performance, various solution approaches have been employed, including decomposition methods and approximation techniques. There has been increasing interest in the development of efficient and accurate solution techniques to solve an integrated ai...
متن کامل